LeetCode Solutions

Appearance

173. 二叉搜索树迭代器 ​

为保证权益，题目请参考 173. 二叉搜索树迭代器(From LeetCode).

解决方案1 ​

CPP ​

C++
/**
 * @brief 节点
 * 
 */
struct TreeNode
{
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode() : val(0), left(nullptr), right(nullptr) {}
    TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
    TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
};

class BSTIterator
{
private:
    TreeNode *head;

public:
    BSTIterator(TreeNode *root)
    {
        this->head = root;
    }

    int next()
    {
    }

    bool hasNext()
    {
    }
};

/**
 * Your BSTIterator object will be instantiated and called as such:
 * BSTIterator* obj = new BSTIterator(root);
 * int param_1 = obj->next();
 * bool param_2 = obj->hasNext();
 */